Auxiliary Lemmas : Proof of Lemma 3
نویسندگان
چکیده
Supplementary Material 6 Auxiliary Lemmas: Proof of Lemma 3 Proof. We can rewrite (6) as an optimization problem over the ℓ 1 /ℓ 2 ball of radius C for some C(λ n) < ∞. 1,2 = C for all optimal primal solution Θ \r. By definition of the ℓ 1 /ℓ 2 subdifferential, we know that for any column u ∈ V \{r}, we have (ˆ Z \r) u 2 ≤ 1. Considering the necessary optimality condition ∇ℓ (ˆ Θ \r) + λ n ˆ Z \r = 0, by complementary slackness condition, we have ⟨ Θ \r , ˆ Z \r ⟩ − C = ⟨ Θ T \r , ˆ Z \r ⟩ − Θ \r 1,2 = 0. Now if for an arbitrary column u ∈ V \{r}, we have (ˆ Z \r) u 2 < 1 and (Θ \r) u ̸ = 0 then this would contradict the condition that ⟨ Θ \r , ˆ Z \r ⟩ = Θ \r 1,2. For this restricted problem, if the Hessian sub-matrix is positive definite, then the problem is strictly convex and it has a unique solution. In this section, we point out the key properties of the gradient, Hessian and derivative of the Hessian for the log-liklihood function. These properties are used to prove the concentration lemmas.
منابع مشابه
A Sharp Form of Whitney’s Extension Theorem
0. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .2 1. Notation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2. Statement of Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 3. Order Relations Involving Multi–indices . . . . . . . ....
متن کاملProof-Pattern Recognition and Lemma Discovery in ACL2
We present a novel technique for combining statistical machine learning for proof-pattern recognition with symbolic methods for lemma discovery. The resulting tool, ACL2(ml), gathers proof statistics and uses statistical pattern-recognition to pre-processes data from libraries, and then suggests auxiliary lemmas in new proofs by analogy with already seen examples. This paper presents the implem...
متن کاملSupplementary On-line Proofs for Sampling-Diagram Automata: a Tool for Analyzing Path Quality in Tree Planners
Note that the main lemma used in the proof of Theorem 2 is Lemma 7 below, and the other lemmas are used as auxiliary geometric lemmas. For completeness , we include in this document a figure of the Promenade motion-planning problem, as it appears in the main text. q1 q2 A1 A2 B1 B2 α α 1 Fig. 1: An illustration of the Promenade motion planning problem, a square obstacle within a square bounding...
متن کاملTowards Certified Slicing
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correctness of slicing, which should ideally be proven independent of concrete programming languages and with the help of well-known verifying techniques such as proof assistants. As a first step in this direction, this cont...
متن کاملEnhancing Inductive Entailment Proofs in Separation Logic with Lemma Synthesis
This paper presents an approach to lemma synthesis to support advanced inductive entailment procedures based on separation logic. We first propose a mechanism where lemmas are automatically proven and systematically applied. Our lemmas may include universal guard and/or unknown predicate. While the former is critical for expressivity, the latter is essential for supporting relationships between...
متن کامل